Bounded game-theoretic semantics for modal mu-calculus
نویسندگان
چکیده
We introduce a new game-theoretic semantics (GTS) for the modal μ-calculus. Our so-called bounded GTS replaces parity games with novel alternative evaluation games where only finite paths arise. Infinite paths are not needed even when the considered transition system is infinite.
منابع مشابه
Enforcing QVT-R with mu-Calculus and Games
QVT-R is the standard Object Management Group bidirectional transformation language. In previous work, we gave a precise game-theoretic semantics for the checkonly semantics of QVT-R transformations, including the recursive invocation of relations which is allowed and used, but not defined, by the QVT standard. In this paper, we take up the problem of enforce semantics, where the standard attem...
متن کاملAlgorithmic correspondence for intuitionistic modal mu-calculus, Part 2
Sahlqvist-style correspondence results remain a perennial theme and an active topic of research within modal logic. Recently, there has been interest in extending the classical results in this area to the modal mu-calculus [7]. For instance, in [8] van Benthem, Bezhanishvili and Hodkinson define a class of Sahlqvist formulas for the modal mu-calculus, all of which have frame correspondents in f...
متن کاملGame semantics for first-order logic
We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results. We use a Church style extension of Parigot’s lambda-mu-calculus to represent proofs of first-order classical logic. We present some relations with Krivine’s classical realizability and applications to type isomorphisms.
متن کاملCompleteness for the modal μ-calculus: separating the combinatorics from the dynamics
The modal mu-calculus is a very expressive formalism extending basic modal logic with least and greatest fixpoint operators. In the seminal paper introducing the formalism in the shape known today, Dexter Kozen also proposed an elegant axiom system, and he proved a partial completeness result with respect to the Kripke-style semantics of the logic. The problem of proving Kozen’s axiom system co...
متن کاملThe Algebraic Mu-Calculus and MTBDDs
The paper presents a new calculus (called algebraic mu-calculus) which generalizes Park's relational mu-calculus by representing arithmetric expressions and real-valued functions rather than formulas and relations. Moreover, we give an algorithm for computing the MTBDD-representation of the semantics for the expressions and terms and show how several problems (such as graph theoretic problems o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1706.00753 شماره
صفحات -
تاریخ انتشار 2017